Pure pairs. I. Trees and linear anticomplete pairs
نویسندگان
چکیده
منابع مشابه
Trees and linear anticomplete pairs
We prove a conjecture of Liebenau, Pilipczuk, and the last two authors [8], that for every forest H there exists ε > 0, such that if G has n ≥ 2 vertices and does not contain H as an induced subgraph, then either • some vertex has degree at most εn; or • there are two disjoint sets A,B ⊆ V (G) with |A|, |B| ≥ εn, such that there are no edges between A,B. (It is known that no graphs H except for...
متن کاملSparse graphs without linear anticomplete pairs
We prove for every graph H there exists > 0 such that, for every graph G with |G| ≥ 2, if no induced subgraph of G is a subdivision of H, then either some vertex of G has at least |G| neighbours, or there are two disjoint sets A,B ⊆ V (G) with |A|, |B| ≥ |G| such that no edge joins A and B. It follows that for every graph H, there exists c > 0 such that for every graph G, if no induced subgraph...
متن کاملSparse graphs with no polynomial-sized anticomplete pairs
A graph is H-free if it has no induced subgraph isomorphic to H. An old conjecture of Conlon, Sudakov and the second author asserts that: • For every graph H, there exists ε > 0 such that in every H-free graph with n > 1 vertices there are two disjoint sets of vertices, of sizes at least εn and εn, complete or anticomplete to each other. This is equivalent to: • The ‘sparse linear conjecture’: ...
متن کاملPartitions, Kostka Polynomials and Pairs of Trees
Bennett et al. [2] presented a recursive algorithm to create a family of partitions from one or several partitions. They were mainly interested in the cases when we begin with a single square partition or with several partitions with only one part. The cardinalities of those families of partitions are the Catalan and ballot numbers, respectively. In this paper we present a non-recursive descrip...
متن کاملON RELATIVE CENTRAL EXTENSIONS AND COVERING PAIRS
Let (G;N) be a pair of groups. In this article, first we con-struct a relative central extension for the pair (G;N) such that specialtypes of covering pair of (G;N) are homomorphic image of it. Second, weshow that every perfect pair admits at least one covering pair. Finally,among extending some properties of perfect groups to perfect pairs, wecharacterize covering pairs of a perfect pair (G;N)...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Mathematics
سال: 2020
ISSN: 0001-8708
DOI: 10.1016/j.aim.2020.107396